Coalgebraic structure from weak limit preserving functors
نویسندگان
چکیده
منابع مشابه
Presentation of Set Functors: A Coalgebraic Perspective
Accessible set functors can be presented by signatures and equations as quotients of polynomial functors. We determine how preservation of pullbacks and other related properties (often applied in coalgebra) are re ected in the structure of the system of equations.
متن کاملA Note on Expressive Coalgebraic Logics for Finitary Set Functors
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L ∗ of the limit L of the first ω terms in the final sequence. L∗ is the set of points in L which arise from all coalgebras using their canonical morphisms into L, and it was used earlier for different purposes in Kurz and Pattinson [5]. Viglizzo in [11...
متن کاملCoalgebraic Weak Bisimulation from Recursive Equations over Monads
Strong bisimulation for labelled transition systems is one ofthe most fundamental equivalences in process algebra, and has beengeneralised to numerous classes of systems that exhibit richer transi-tion behaviour. Nearly all of the ensuing notions are instances of themore general notion of coalgebraic bisimulation. Weak bisimulation, how-ever, has so far been much less amenab...
متن کاملCoalgebraic Weak Bisimulation for Action-Type Systems
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bifunctors in the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The particular transformation consists of two steps: First, the behavior on actions is lifted to behavior on finite words. Second, the behavior on finite words is taken modulo t...
متن کاملOn Corecursive Algebras for Functors Preserving Coproducts
For an endofunctor H on a hyper-extensive category preserving countable coproducts we describe the free corecursive algebra on Y as the coproduct of the final coalgebra for H and the free Halgebra on Y . As a consequence, we derive that H is a cia functor, i.e., its corecursive algebras are precisely the cias (completely iterative algebras). Also all functors H(−) + Y are then cia functors. For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80346-9